| Definitions | s = t, t  T, ES, Type, AbsInterface(A), E,  A, x:A  B(x),  b, x:A  B(x), left + right, let x,y = A in B(x;y), t.1, Void, P   Q, False, type List, first(e), {x:A| B(x)} , E(X),  x:A. B(x), a:A fp B(a), strong-subtype(A;B), case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , e  X,  , Top,  x:A.B(x), f  g, f(x)?z, loc(e), vartype(i;x), state@i, P  Q, P & Q, P Q, State(ds), State(ds), <a, b>, f(a), x dom(f), {T}, EqDecider(T), Unit, IdLnk, Id, EOrderAxioms(E; pred?; info), EState(T), Knd,   x. t(x), x,y. t(x;y), kindcase(k; a.f(a); l,t.g(l;t) ), Msg(M),  ,  , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), e < e', r  s, constant_function(f;A;B), X(e), ff, inr x , tt, inl x , True, x.A(x),  , [], [car / cdr], mapfilter(f;P;L), A List , before(e), s ~ t, concat(ll), pred(e), es-interface-history(es;X;e), as @ bs, (x l), es-le-before(es;e), p =b q, i <z j, i z j, (i = j), x =a y, null(as), a < b, x f y, a < b, [d], eq_atom$n(x;y), q_le(r;s), q_less(a;b), qeq(r;s), a = b, a = b, deq-member(eq;x;L), b, p q, p  q, p  q,  ,  T |
